Identyfikacja genów związanych z ekspresją zimotrwałości i tolerancji suszy u form introgresywnych Lolium multiflorum/Festuca arundinacea

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lactose and Whey U T I L I Z a T I O N by Rats and Swine I

The growth rate and feed efficiency of pigs fed a diet containing 10% dried whey and 20% alfalfa was less than with either treatment alone, suggesting a possible antagonism between alfalfa and whey. A digestibility trial with rats indicated that feeding lactose, a major constituent of whey, reduced the digestibility of alfalfa fiber and purified cellulose. In another rat experiment, the feeding...

متن کامل

Quinoxaline: Z′ = 1 form

A new Z' = 1 crystal structure of quinoxaline (or 1,4-diaza-naphthalene), C(8)H(6)N(2), with one-fifth the volume of the earlier known Z' = 5 structure was obtained by means of an in situ cryocrystallization technique.

متن کامل

On $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-$(1+u)$-additive constacyclic

In this paper, we study Z2Z2[u]-(1 + u)-additive constacyclic code of arbitrary length. Firstly, we study the algebraic structure of this family of codes and a set of generator polynomials for this family as a (Z2+uZ2)[x]-submodule of the ring Rα,β. Secondly, we give the minimal generating sets of this family codes, and we determine the relationship of generators between the Z2Z2[u]-(1 + u)-add...

متن کامل

$\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes

Abstract: In this paper, we study ZpZp[u]-additive codes, where p is prime and u 2 = 0. In particular, we determine a Gray map from ZpZp[u] to Z α+2β p and study generator and parity check matrices for these codes. We prove that a Gray map Φ is a distance preserving map from (ZpZp[u],Gray distance) to (Z α+2β p ,Hamming distance), it is a weight preserving map as well. Furthermore we study the ...

متن کامل

Cyclic codes over $\mathbb{Z}_4+u\mathbb{Z}_4$

In this paper, we have studied cyclic codes over the ring R = Z4 +uZ4, u = 0. We have considered cyclic codes of odd lengths. A sufficient condition for a cyclic code over R to be a Z4-free module is presented. We have provided the general form of the generators of a cyclic code over R and determined a formula for the ranks of such codes. In this paper we have mainly focused on principally gene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Biuletyn Instytutu Hodowli i Aklimatyzacji Roślin

سال: 2019

ISSN: 2657-8913,0373-7837

DOI: 10.37317/biul-2019-0084